package org.share.develop.algorithm.tree;


/**
 *
 *
 * https://www.youtube.com/watch?v=mYGYbZxrU_4
 * https://blog.csdn.net/u011089927/article/details/53647951
 *  找到第一个不平衡的结点a
 *  a结点降层
 *  a的不平衡边升层
 *  a的不平衡边子结点剪Zhi 产生悬浮子树
 *  子树拼接到a的另一个孩子结点
 */
public class Rolate {

}
